Analysis of Evolved Response Thresholds for Decentralized Dynamic Task Allocation

نویسندگان

چکیده

In this work, we investigate the application of a multi-objective genetic algorithm to problem task allocation in self-organizing, decentralized, threshold-based swarm. We use evolve response thresholds for simulated swarm engaged dynamic problems: two-dimensional and three-dimensional collective tracking. show that evolved not only outperform uniformly distributed but achieve nearly optimal performance on variety tracking instances (target paths). More importantly, demonstrate some generalize all other instances, eliminating need new each instance be solved. analyze properties allow these paths serve as universal training they are quite natural. After priori evolution, our system static. The solved by swarms highly dynamic, with schedules demands change over time significant differences rate magnitude change. That is able results refutes common assumption must perform well environment.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asynchronous Decentralized Task Allocation for Dynamic Environments

This work builds on a decentralized task allocation algorithm for networked agents communicating through an asynchronous channel. The algorithm extends the Asynchronous Consensus-Based Bundle Algorithm (ACBBA) to account for more real time implementation issues resulting from a decentralized planner. This work utilizes a new implementation that allows further insight into the consensus and mess...

متن کامل

Decentralized Task Allocation for Dynamic Environments

This thesis presents an overview of the design process for creating greedy decentralized task allocation algorithms and outlines the main decisions that progressed the algorithm through three different forms. The first form was called the Sequential Greedy Algorithm (SGA). This algorithm, although fast, relied on a large number of iterations to converge, which slowed convergence in decentralize...

متن کامل

Effects of Task Consideration Order on Decentralized Task Allocation Using Time-Variant Response Thresholds

In this work, we investigate how the order in which tasks are considered to be acted upon by probabilistic agents with time-variant response thresholds within a fully decentralized multiagent system may affect task allocation, task fulfillment levels, specialization tendencies, and system robustness. The tested ordering schemas are: (1) ascending subjective action threshold, (2) descending obje...

متن کامل

Decentralized Dynamic Task Allocation Using Overlapping Potential Games

This paper reports on a novel decentralised technique for planning agent schedules in dynamic task allocation problems. Specifically, we use a stochastic game formulation of these problems in which tasks have varying hard deadlines and processing requirements. We then introduce a new technique for approximating this game using a series of static potential games, before detailing a decentralised...

متن کامل

A Market Protocol for Decentralized Task Allocation

We present a decentralized market protocol for allocating tasks among agents that contend for scarce resources. Agents trade tasks and resources at prices determined by an auction protocol. We specify a simple set of bidding policies that, along with the auction mechanism, exhibits desirable convergence properties. The system always reaches quiescence. If the system reaches quiescence below the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM transactions on evolutionary learning

سال: 2022

ISSN: ['2688-3007', '2688-299X']

DOI: https://doi.org/10.1145/3530821